Performance Analyses on Population Seeding Techniques for Genetic Algorithms
نویسندگان
چکیده
In Genetic Algorithm (GA), the fitness or quality of individual solutions in the initial population plays a significant part in determining the final optimal solution. The traditional GA with random population seeding technique is simple and proficient however the generated population may contain poor fitness individuals, which take long time to converge to the optimal solution. On the other hand, the hybrid population seeding techniques, which have the benefits of generating good fitness individuals and fast convergence to the optimal solution. Researchers have proposed several population seeding techniques using the background knowledge on the problem taken to solve. In this paper, we analyse the performance of different population seeding techniques for the permutation coded genetic algorithm based on the quality of the individuals generated. Experiments are carried out using the famous Travelling Salesman Problem (TSP) benchmark instances obtained from the TSPLIB, which is the standard library for TSP problems. The experimental results show the order of performance of different population seeding techniques in terms of Convergence Rate (%) and Error Rate (%). Keyword Genetic Algorithm, Population Seeding Technique, Travelling Salesman Problem, Performance Analysis, MATLAB
منابع مشابه
Multi-Task Learning and Transfer: The Effect of Algorithm Representation
Exploring multiple classes of learning algorithms for those algorithms which perform best in multiple tasks is a complex problem of multiple-criteria optimisation. We use a genetic algorithm to locate sets of models which are not outperformed on all of the tasks. The genetic algorithm develops a population of multiple types of learning algorithms, with competition between individuals of differe...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملApplication of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems
The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...
متن کاملResearch of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کاملResearch of Blind Signals Separation with Genetic Algorithm and Particle Swarm Optimization Based on Mutual Information
Blind source separation technique separates mixed signals blindly without any information on the mixing system. In this paper, we have used two evolutionary algorithms, namely, genetic algorithm and particle swarm optimization for blind source separation. In these techniques a novel fitness function that is based on the mutual information and high order statistics is proposed. In order to evalu...
متن کامل